A Heuristic Algorithm for Plate SelectionThat Maximizes Compound Diversity
نویسندگان
چکیده
منابع مشابه
A Heuristic Algorithm for Plate SelectionThat Maximizes Compound Diversity
A heuristic algorithm was developed to maximize compound diversity within a subset of screening plates used in high throughput screening (HTS) to initiate the drug discovery process. The approach overcame the challenge of combinatorial explosion for selecting plate subsets with maximum compound diversity. The method yielded novel forms of plate-based diversity subsets (PBDS) for HTS screening i...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملBeamforming Maximizes the Miso Compound Capacity
In this paper, we consider the optimization of the compound capacity in multiple input single output channels using partial channel state information at the transmitter side. We model the channel as a deterministic vector within a known ellipsoid, and maximize the compound capacity defined as the worst case capacity within this set. We find that the optimal transmit strategy is always beamformi...
متن کاملA Novel Heuristic Algorithm Based on Clark and Wright Algorithm for Green Vehicle Routing Problem
A significant portion of Gross Domestic Production (GDP) in any country belongs to the transportation system. Transportation equipment, in the other hand, is supposed to be great consumer of oil products. Many attempts have been assigned to the vehicles to cut down Greenhouse Gas (GHG). In this paper a novel heuristic algorithm based on Clark and Wright Algorithm called Green Clark and Wright (...
متن کاملA Hybrid Meta-Heuristic Algorithm based on Imperialist Competition Algorithm
The human has always been to find the best in all things. This Perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables and find the best acceptable answer Due to the limitations of the problem, So that the objective function is minimum or maximum. One of the ways inaccurate optimization is meta-heuristics so that Inspired by nature, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Croatica Chemica Acta
سال: 2013
ISSN: 0011-1643,1334-417X
DOI: 10.5562/cca2301